Connected perimeter of planar sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Four-connected triangulations of planar point sets

In this paper, we consider the problem of determining in polynomial time whether a given planar point set P of n points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing P , and present an O(n) algorithm of constructing a 4-connected triangulation of P . Thus, our algorithm solves a longstanding open problem in computational geometry and geometric...

متن کامل

Point sets with planar embeddings of cubic, connected graphs

Let P be a set of n ≥ 3 points in the plane in general position with n even and let h being the number of points on the convex hull of P . We want to know in which cases P admits a planar embedding of a cubic, connected graph (a “cubic embedding”)? García et al. proved in [1] that cubic embeddings always exists for h ≤ 4n, but for higher values of h the question remained open. We present a char...

متن کامل

Connected Components of Sets of Finite Perimeter and Applications to Image Processing

This paper contains a systematic analysis of a natural measure theoretic notion of connectedness for sets of finite perimeter in IR, introduced by H. Federer in the more general framework of the theory of currents. We provide a new and simpler proof of the existence and uniqueness of the decomposition into the so-called M -connected components. Moreover, we study carefully the structure of the ...

متن کامل

Perimeter of sets and BMO-type norms

Article history: Received 10 July 2014 Accepted 10 July 2014 Available online xxxx Presented by Haïm Brezis The aim of this note is to announce some recent results showing that an isotropic variant of the BMO-type norm introduced in [3] can be related via a precise formula to the perimeter of sets. © 2014 Published by Elsevier Masson SAS on behalf of Académie des sciences.

متن کامل

Quadrangulations of Planar Sets

A linear-time algorithm for decomposing recti-linear star-shaped polygons into convex quadrilaterals, " Proc.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Calculus of Variations

سال: 2020

ISSN: 1864-8266,1864-8258

DOI: 10.1515/acv-2019-0050